In this paper, we devise three deterministic algorithms for solving the$m$-set $k$-packing, $m$-dimensional $k$-matching, and $t$-dominating setproblems in time $O^*(5.44^{mk})$, $O^*(5.44^{(m-1)k})$ and $O^*(5.44^{t})$,respectively. Although recently there has been remarkable progress onrandomized solutions to those problems, our bounds make good improvements onthe best known bounds for deterministic solutions to those problems.
展开▼
机译：在本文中，我们设计了三种确定性算法来及时解决$ m $ -set $ k $ -packing，$ m $-维$ k $ -matching和$ t $ -domination设置问题$ O ^ *（5.44 ^ {mk}）$，$ O ^ *（5.44 ^ {（m-1）k}）$和$ O ^ *（5.44 ^ {t}）$。尽管最近在解决这些问题的随机解决方案方面已经取得了显着进展，但是我们的界限在确定性解决这些问题的最著名界限上做了很好的改进。
展开▼
